Max-Min Processors Scheduling

This paper focuses on the maximization of minimum completion time identical parallel processors. The objective this is to ensure fair distribution. Let a set jobs be assigned several problem shown as NP-hard. research work based essentially comparison proposed heuristics with others cited in literature review. Our are developed using randomization method and iterative utilization knapsack solve studied problem. Heuristics assessed by instances represented experimental results. results show that heuristic gives almost similar performance than review but better running time.